On Embeddings of Circulant Graphs
نویسندگان
چکیده
A circulant of order n is a Cayley graph for the cyclic group Zn, and as such, admits a transitive action of Zn on its vertices. This paper concerns 2-cell embeddings of connected circulants on closed orientable surfaces. Embeddings on the sphere (the planar case) were classified by Heuberger (2003), and by a theorem of Thomassen (1991), there are only finitely many vertex-transitive graphs with minimum genus g, for any given integer g > 3. Here we completely determine all connected circulants with minimum genus 1 or 2; this corrects and extends an attempted classification of all toroidal circulants by Costa, Strapasson, Alves and Carlos (2010).
منابع مشابه
Genus distributions of orientable embeddings for two types of graphs
Abstract On the basis of the joint tree model introduced by Liu in 2003, the genus distributions of the orientable embeddings for further types of graphs can be obtained. These are apparently not easily obtained using overlap matrices, the formula of Jackson, etc. In this paper, however, by classifying the associated surfaces, we calculate the genus distributions of the orientable embeddings fo...
متن کاملRecognizing Recursive Circulant Graphs G(cd M ; D)
Recursive circulant graphs G(N; d) have been introduced in 1994 by Park and Chwa PC94] as a new topology for interconnection networks. Recursive circulant graphs G(N; d) are circu-lant graphs with N nodes and with jumps of powers of d. A subfamily of recursive circulant graphs (more precisely, G(2 k ; 4)) is of same order and degree than the hypercube of dimension k, with sometimes better param...
متن کاملRecognizing Recursive
Recursive circulant graphs G(N; d) have been introduced in 1994 by Park and Chwa [PC94] as a new topology for interconnection networks. Recursive circulant graphs G(N; d) are circulant graphs with N nodes and with jumps of powers of d. A subfamily of recursive circulant graphs (more precisely, G(2; 4)) is of same order and degree than the hypercube of dimension k, with sometimes better paramete...
متن کاملDistance-Hereditary Embeddings of Circulant Graphs
In this paper we present a distance-hereditary decomposition of optimal chordal rings of 2k nodes into a set of rings of 2k nodes, where k is the diameter. All the rings belonging to this set have the same length and their diameter corresponds to the diameter of the chordal ring in which they are embedded. The members of this embedded set of rings are non-disjoint and preserve the minimal routi...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015